Generalizations of Higher-Order Duality for Multiple Objective Nonlinear Programming under the Generalizations of Type-I Functions
نویسندگان
چکیده
In this study, we introduce new generalizations of higher-order type-I functions and pseudo-convexity functions. The application the notion sublinear functionals to these is crucial our main findings. Furthermore, under functions, established studied six types duality models programs for multiple objective nonlinear programming problems. addition, use formulate prove theorems weak duality, strong strict converse model programs.
منابع مشابه
Some Generalizations of Fedorchuk Duality Theorem – I
Generalizing Duality Theorem of V. V. Fedorchuk [11], we prove Stone-type duality theorems for the following four categories: all of them have as objects the locally compact Hausdorff spaces, and their morphisms are, respectively, the continuous skeletal maps, the quasi-open perfect maps, the open maps, the open perfect maps. In particular, a Stone-type duality theorem for the category of all c...
متن کاملGeneralizations of Matroid Duality
Matroid duality is an important generalization of duality for planar graphs. Using unpublished notes of Brylawski, we extend this notion to arbitrary set systems. This allows one to define a generalized Tutte polynomial. We examine this polynomial for several set systems that are not matroids, and we also investigate the combinatorial significance of duality for these set systems.
متن کاملMap Duality and Generalizations
A map is an embedding of a graph into a surface so that each face is simply connected. Geometric duality, whereby vertices and faces are reversed, is a classic construction for maps. A generalization of map duality is given and discussed both graph and group theoretically.
متن کاملGeneralizations of Wei's Duality Theorem
Wei’s celebrated Duality Theorem is generalized in several ways, expressed as duality theorems for linear codes over division rings and, more generally, duality theorems for matroids. These results are further generalized, resulting in two Wei-type duality theorems for new combinatorial structures that are introduced and named demi-matroids. These generalize matroids and are the appropriate com...
متن کاملHigher-Order Duality in Nondifferentiable Minimax Programming with Generalized Type I Functions
A unified higher-order dual for a nondifferentiable minimax programming problem is formulated. Weak, strong and strict converse duality theorems are discussed involving generalized higher-order (F,α,ρ, d)-Type I functions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11040889